commitment ordering造句
例句與造句
- "Commitment ordering " ( CO ) is a special case of conflict serializability.
- The commitment ordering solution comprises effective integration of autonomous database management systems with possibly different concurrency control mechanisms.
- It is proven to be an effective mechanism in many situations, and provides besides Serializability also Strictness and Commitment ordering properties.
- The underlying " Theory of Commitment ordering ", part of Serializability theory, is both sound and distributed applications.
- Commitment ordering, publicly introduced in May 1991 ( see below ), provides an efficient Strong strict two-phase locking ( SS2PL ).
- It's difficult to find commitment ordering in a sentence. 用commitment ordering造句挺難的
- It seems that they have not understood the article and what is so special in Commitment ordering ( see it explicitly in Global serializability ).
- User : Comps, the major contributor to Commitment ordering, has been blocked for an indefinite period due to User : Ruud Koot s initiative.
- For an extensive coverage of commitment ordering and its sources see " Commitment ordering " and " The History of Commitment Ordering ".
- For an extensive coverage of commitment ordering and its sources see " Commitment ordering " and " The History of Commitment Ordering ".
- For an extensive coverage of commitment ordering and its sources see " Commitment ordering " and " The History of Commitment Ordering ".
- An increasingly utilized method to manage transactional conflicts in Transactional memory, and especially in STM, is Commitment ordering ( also called Commit ordering; CO ).
- Commitment ordering ( CO ) is a revolutionary method which has become a standard solution in many areas of computerized technology, and its utilization increases from day to day.
- For implementing "'Optimistic commitment ordering "'( OCO ) the generic local CO algorithm is utilized without data access blocking, and thus without local deadlocks.
- All the commitment ordering theoretical results are applicable whenever atomic commitment is utilized over partitioned, distributed recoverable ( transactional ) data, including automatic " distributed deadlock " resolution.
- It originated at the MIT and was compared to Commitment ordering thoroughly in the deleted article " History of commitment ordering ", now in user space for rewrite ( ).
更多例句: 下一頁